Some Inplace Identities for Integer Compositions
نویسنده
چکیده
In this paper, we give two new identities for compositions, or ordered partitions, of integers. These two identities are based on closely-related integer partition functions which have recently been studied. Thanks to the structure inherent in integer compositions, we are also able to extensively generalize both of these identities. Bijective proofs are given and generating functions are provided for each of the types of compositions which arise. A number of arithmetic properties satisfied by the functions which count such compositions are also highlighted.
منابع مشابه
Decomposable Compositions, Symmetric Quasisymmetric Functions and Equality of Ribbon Schur Functions
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of a factorization for compositions: equivalent compositions have factorizations that differ only by reversing some of the terms. As an application, we can deri...
متن کاملINVERSE-CONJUGATE COMPOSITIONS INTO PARTS OF SIZE AT MOST k
An inverse-conjugate composition of a positive integer m is an ordered partition of m whose conjugate coincides with its reversal. In this paper we consider inverseconjugate compositions in which the part sizes do not exceed a given integer k. It is proved that the number of such inverse-conjugate compositions of 2n − 1 is equal to 2F n , where F (k) n is a Fibonacci k-step number. We also give...
متن کاملMatrix Compositions
In this paper we study the class of m-row matrix compositions (m-compositions, for short), i.e., m-row matrices with nonnegative integer entries in which every column has at least one non-zero element. We provide several enumerative results, various combinatorial identities, and some combinatorial interpretations. Most of these properties are an extension to matrix compositions of the combinato...
متن کاملEuler-type Identities for Integer Compositions via Zig-zag Graphs
This paper is devoted to a systematic study of combinatorial identities which assert the equality of different sets of compositions, or ordered partitions, of integers. The proofs are based on properties of zig-zag graphs the graphical representations of compositions introduced by Percy A. MacMahon in his classic book Combinatory Analysis. In particular it is demonstrated, by means of general t...
متن کاملOn the identities of modulo-p partitions
Some identities between partitions and compositions were obtained in the literature. As a natural extension, we introduce and study modulo-p partitions, where p is a positive integer. Moreover, several recurrence relations and some sufficient conditions for the existence of modulo-p partitions are given, respectively. In addition, we obtain some identities of modulo-p partitions. In the end, us...
متن کامل